Dynamic Programming Models and Algorithms for the Mutual Fund Cash Balance Problem

نویسندگان

  • Juliana M. Nascimento
  • Warren B. Powell
چکیده

Fund managers have to decide the amount of a fund’s assets that should be kept in cash, considering the tradeoff between being able to meet shareholder redemptions and minimizing the opportunity cost from lost investment opportunities. In addition, they have to consider redemptions by individuals as well as institutional investors, the current performance of the stock market and interest rates, and the pattern of investments and redemptions which are correlated with market performance. We formulate the problem as a dynamic program, but this encounters the classic curse of dimensionality. To overcome this problem, we propose a provably convergent approximate dynamic programming algorithm. We also adapt the algorithm to an online environment, requiring no knowledge of the probability distributions for rates of return and interest rates. We use actual data for market performance and interest rates, and demonstrate the quality of the solution (compared to the optimal) for the top 10 mutual funds in each of nine fund categories. We show that our results closely match the optimal solution (in considerably less time), and outperform two static (newsvendor) models. The result is a simple policy that describes when money should be moved into and out of cash based on market performance.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Defined Benefit Pension Fund ALM Model through Multistage Stochastic Programming

We consider an asset-liability management (ALM) problem for a defined benefit pension fund (PF). The PF manager is assumed to follow a maximal fund valuation problem facing an extended set of risk factors:  due to the longevity of the    PF members, the inflation affecting salaries in real terms and future incomes, interest rates and market factors affecting jointly the PF liability and asset p...

متن کامل

Approximate Dynamic Programming—ii: Algorithms

• Option Pricing. An American option allows us to buy or sell an asset at any time up to a specified time, where we make money when the price goes under or over (respectively) a set strike price. Valuing the option requires finding an optimal policy for determining when to exercise the option. • Playing Games. Computer algorithms have been designed to play backgammon, bridge, chess, and recentl...

متن کامل

Mathematical Programming Models for Solving Unequal-Sized Facilities Layout Problems - a Generic Search Method

 This paper present unequal-sized facilities layout solutions generated by a genetic search program named LADEGA (Layout Design using a Genetic Algorithm). The generalized quadratic assignment problem requiring pre-determined distance and material flow matrices as the input data and the continuous plane model employing a dynamic distance measure and a material flow matrix are discussed. Computa...

متن کامل

Project resource investment problem under progress payment model

As a general branch of project scheduling problems, resource investment problem (RIP) considers resource availabilities as decision variables to determine a level of employed resources minimizing the costs of the project. In addition to costs (cash outflows), researchers in the later extensions of the RIP took payments (cash inflows) received from clients into account and used the net present v...

متن کامل

Excess Cash and Mutual Fund Performance

I document a positive relationship between excess cash holdings of actively managed equity mutual funds and future fund performance. The difference in returns of portfolios of high and of low excess cash funds amounts to over 2% annually, or approximately 3% after standard risk adjustment. I study whether this difference in performance can be explained by the differences in managerial stock sel...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Management Science

دوره 56  شماره 

صفحات  -

تاریخ انتشار 2010